منابع مشابه
On Truth-Table Reducibility to SAT
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as logspace truth-table reducibility via Boolean formulas to SAT and the same as logspace Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. We give an oracle relative to which ∆p2 is not equal to...
متن کاملOn The Structures Inside Truth-Table Degrees
The following theorems on the structure inside nonrecursive truth-table degrees are established: D egtev's result that the number of bounded truth-table degrees inside a truth-table degree is at least two is improved by showing that this number is innnite. There are even innnite chains and an-tichains of bounded truth-table degrees inside the truth-table degrees which implies an aarmative answe...
متن کاملThe Hard Truth
Bayesian methodology provides the means to combine prior knowledge about competing models of reality and available data to draw inferences about the validity of those models. The posterior quantifies the degree of certainty one has about those models. We propose a method to determine the uncertainty in a specific feature of a Bayesian solution. Our approach is based on an analogy between the ne...
متن کاملOn Small Hard Leaf Languages
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give “short” representations for leaf words. We then use seeds to show that leaf languages A with NP ⊆ BLeaf (A) cannot be polylog-sparse (i.e. censusA ∈ O(log )), unless PH collapses. We also generalize balanced ≤ m -reduc...
متن کاملOn Sets Bounded Truth-Table Reducible to P-selective Sets
We show that if every NP set is polynomial time bounded truth table reducible to some P selective set then NP is contained in DTIME n O p logn In the proof we implement a recursive procedure that reduces the number of nondeterministic steps of a given nondeter ministic computation
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90126-e